Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time
نویسندگان
چکیده
منابع مشابه
Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملScheduling with Rejection to Minimize the Total Weighted Completion Time∗
In this paper, we address the scheduling problem with rejection in which we can choose a subset of jobs to process. Choosing not to process any job incurs a corresponding penalty. We consider the following problem for the first time: scheduling with rejection to minimize the total weighted completion time with the constraint of total penalties on identical parallel machines, where the number of...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flowtime through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical ...
متن کاملIs a Unit - Time Job Shop Not Easierthan
This paper gives the positive answer to the question posed in the title for a wide class of minimization criteria including the maximum completion time, maximum lateness , total completion time, total weighted completion time, total tardiness, total weighted tardiness, number of late jobs and the weighted number of late jobs. That is any scheduling problem for m identical parallel machines to m...
متن کاملScheduling Multiple Families of Jobs on Parallel Machines to Minimize Total Weighted Completion Time
We consider the problem of scheduling multiple families of jobs on identical parallel machines to minimize the total weighted completion time of the jobs. In this problem, a setup time is necessary whenever a job from one family is processed immediately after another job from a di erent family. The setup time could be sequence independent or sequence dependent. We propose a column generation ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 48 شماره
صفحات -
تاریخ انتشار 1994